منابع مشابه
Risk , uncertainty and prophet : The psychological insights
Economist Frank H. Knight (1885–1972) is commonly credited with defining the distinction between decisions under “risk” (known chance) and decisions under “uncertainty” (unmeasurable probability) in his 1921 book Risk, Uncertainty and Profit. A closer reading of Knight (1921) reveals a host of psychological insights beyond this risk-uncertainty distinction, many of which foreshadow revolutionar...
متن کاملPolymatroid Prophet Inequalities
Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence at once. The goal of both is to decide on fractions of each number they want to keep so as to maximize the weighted fractional sum of the numbers chosen. The classic result of Krengel and Sucheston (1977-78) asserts th...
متن کاملMatroid Prophet Inequalities and Bayesian Mechanism Design
Consider a gambler who observes a sequence of independent, non-negative random numbers and is allowed to stop the sequence at any time, claiming a reward equal to the most recent observation. The famous prophet inequality of Krengel, Sucheston, and Garling asserts that a gambler who knows the distribution of each random variable can achieve at least half as much reward, in expectation, as a "pr...
متن کامل4 Lies , Rape , and Statutory Rape
Whenadefendant lies or uses other forms of deception to induce an adult partner into sex, the law only rarely treats that as rape, even if the partner would not have engaged in the act absent the deception.But when the defendant himself is deceived into having sex with a partner who is underage, such deception is normally no defense to charges of statutory rape, even if, once again, it was a “b...
متن کاملCombinatorial Prophet Inequalities
We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an O(1)-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an O(log n log r)-competitive algorithm (where r is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Index on Censorship
سال: 1999
ISSN: 0306-4220,1746-6067
DOI: 10.1080/03064229908536496